IQoSM: 一种支持多媒体传输 QoS 服务的框架模型

随着多媒体应用的发展 ,网络 Qo S保证问题日益突出 ,各种 Qo S服务的策略和算法也层出不穷。如何适应不同应用的特点 ,提出统一的 Qo S框架模型 ,在此基础上根据不同应用需求进行 Qo S策略变换、算法更新 ,是值得深入研究问题。文中提出一种 Qo S管理框架模型—— IQo SM ( Integrated Qo SModel)。 IQo SM模型提供完整的 Qo S管理框架结构 ;各模块相互独立 ,协调合作 ,便于开发。它独立于具体 Qo S算法、策略 ,具有高度的灵活性、可构造性 ,便于算法更新与改造。最后还给出 IQo SM在 CORBAA/ V STREAM机制上的实现设计     

地炮营通信系统载波监听／碰撞检测仿真分析

给出某地炮营通信系统信息传输的CSMA／CD(Carrier Sense Multiple Acces／Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案     

C4ISR系统需求工程中作战过程描述方法

对于建设C4ISR系统来说,系统需求工程的出发点之一应该是基于对作战的描述.同时对目前作战过程进行描述的若干方法进行分析对比,结合实际情况对作战过程描述进行讨论并给出新的切入点,最后给出一个简单的描述示例.     

信息战战场分析模型

根据区域攻防的不同战场信息行动,建立3个非线性微分方程模型.以防御方的总射击速率和战斗力消耗率作为评价指标,着重探讨了进攻方的指挥控制系统、侦察监视系统、战毁评估系统和火力系统之间的性能匹配关系.     

防空导弹武器系统C3I仿真系统一体化研究

现代化的高科技战争中,C3I系统已成为武器系统的"神经中枢",建立一体化的C3I系统是联合作战、统一指挥的需要,同时也对C3I的仿真系统提出了一体化的要求。结合防空导弹武器两级指控仿真系统互操作问题的研究,首先简要介绍了仿真系统一体化的有关标准,然后介绍了互连的方式和对象,探讨和分析了互操作的模型、特点以及互操作性等级的评定。     

分布式防空C3I模型信息关系及其交互关键技术研究

对分布式防空C3I仿真中信息交互关键技术进行了研究。分析了各子模型信息关系,研究了信息有效交互的途径和提高信息交互速度的方法,并对组播通信组的划分方法进行了深入研究,提出了基于信息流的组播通信组的划分方法。     

指挥控制通信与情报(C3I)系统的评价

综述了目前用于评价Ｃ３Ｉ系统的各类方法与过程,讨论了Ｃ３Ｉ系统的评价框架,并对这个框架下的各种评价方法与过程的长处和不足提出了作者的看法     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007